IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 5, MAY[removed]Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

Source URL: www.eecs.berkeley.edu

• Convex analysis
• Operations research
• Convex optimization
• Convex function
• Lipschitz continuity
• Computational complexity theory
• Oracle machine
• Stochastic gradient descent
• PP
• Mathematical optimization
• Mathematical analysis
• Mathematics

Driver Verifier in Windows 7 October 22, 2012 Abstract Driver Verifier monitors kernel-mode drivers to detect incorrect function calls or actions that might corrupt the system. In Windows® 7, Driver Verifier has sever

Source URL: download.microsoft.com

• System software
• Applied mathematics
• Software
• Driver Verifier
• Windows Driver Foundation
• The Verifier
• NP
• Architecture of Windows NT
• IP
• Device drivers
• Windows NT
• Complexity classes

SIAM J. COMPUT. Vol. 32, No. 6, pp. 1570–1585 c 2003 Society for Industrial and Applied Mathematics 

Source URL: www.cs.berkeley.edu

• Mathematics
• Communication complexity
• Quantum superposition
• Qubit
• Information theory
• Function
• Quantum algorithm
• Mutual information
• Quantum teleportation
• Theoretical computer science
• Quantum information science
• Applied mathematics

Abstract The problem of polynomial representability of functions is central to many branches of mathematics. If the underlying set is a finite field, every function can be represented as a polynomial. In this thesis we c

Source URL: etd.ncsi.iisc.ernet.in

• Complexity classes
• Polynomial
• P
• Finite field
• Algorithm
• Computational problems
• Theoretical computer science
• Mathematics
• Applied mathematics

Reconstructing Boolean Models of Signaling Roded Sharan1 and Richard M. Karp2 1 Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel, [removed]

Source URL: www.cs.tau.ac.il

• Boolean algebra
• Algebraic logic
• Computational complexity theory
• Mathematical logic
• Logic
• Boolean function
• Artificial neuron
• Boolean circuit
• Circuit
• Mathematics
• Theoretical computer science
• Applied mathematics

1 A robust FFAST framework for computing a k -sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes

Source URL: basics.eecs.berkeley.edu

• Algebra
• Digital signal processing
• Discrete Fourier transform
• Fast Fourier transform
• DFT matrix
• Window function
• Fourier transform
• Vector space
• Mathematical analysis
• Fourier analysis
• Mathematics

First Modes of Operation Workshop (October[removed]Key Feedback Mode: a Keystream Generator with Provable Security

Source URL: csrc.nist.gov

• Pseudorandomness
• Randomness
• Computational complexity theory
• Pseudorandom generator theorem
• Pseudorandom generator
• Random number generation
• Random seed
• Random permutation
• One-way function
• Cryptography
• Theoretical computer science
• Applied mathematics

Complexity of Ten Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi, Anirudha Majumdar, and Russ Tedrake Abstract— We show that for continuous time dynamical systems described by polynomial differe

Source URL: groups.csail.mit.edu

• Stability theory
• Linear algebra
• Trigonometry
• Differential calculus
• Polynomials
• Lyapunov stability
• Lyapunov function
• Homogeneous function
• Differential equation
• Mathematics
• Mathematical analysis
• Algebra

Juvenile Justice • 119 another layer to the complexity of the overall system. Home rule allows cities and counties throughout the state to function with a great deal of autonomy. Therefore, most juvenile justice servi

Source URL: www.publicsafety.ohio.gov

Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate

Source URL: www.icml2010.org

• Estimation theory
• Maximum likelihood
• Statistical theory
• XTR
• Time complexity
• Spectral theory of ordinary differential equations
• Non-analytic smooth function
• Theoretical computer science
• Mathematics
• Applied mathematics